On weakly orthogonal constructor-based graph rewriting
نویسندگان
چکیده
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not connuent in general whereas it is connuent in the case of weakly orthogonal term rewriting systems. We show, however , that the considered relation is always connuent, as well as connuent modulo bisimilarity, for a large class of graphs called admissible graphs. Afterwards, we consider parallel graph rewriting and propose a parallel graph rewriting strategy which is optimal with respect to strategies that do not consider the right-hand sides of the rules.
منابع مشابه
Parallel Admissible Graph Rewriting
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in general whereas it is confluent in the case of weakly orthogonal term rewriting systems. We show, however, that the considered relation is always confluent, as well as confluent modulo bisimilarity, for a large class of g...
متن کاملUnion of Reducibility Candidates for Orthogonal Constructor Rewriting
We revisit Girard’s reducibility candidates by proposing a general of the notion of neutral terms. They are the terms which do not interact with some contexts called elimination contexts. We apply this framework to constructor rewriting, and show that for orthogonal constructor rewriting, Girard’s reducibility candidates are stable by union.
متن کاملComplete Strategies for Admissible-Graph Collapsing Narrowing
Narrowing constitutes the basis of the operational semantics of modern declarative languages which integrate functional and logic programming paradigms. Efficient implementations of these languages consider first-order terms as graphs. In this paper, we investigate narrowing in the setting of graph rewriting systems. We take the full advantage of graph structures by allowing maximal sharing of ...
متن کاملAdmissible Graph Rewriting and Narrowing
We address the problem of graph rewriting and narrowing as the underlying operational semantics of rule-based programming languages. We propose new optimal graph rewriting and narrowing strategies in the setting of orthogonal constructor-based graph rewriting systems. For this purpose, we first characterize a subset of graphs, called admissible graphs. A graph is admissible if none of its defin...
متن کاملSequential Implementation of Parallel Narrowing
Parallel narrowing has been proposed by Antoy, Echahed and Hanus. They generalize to narrowing the notion of necessary set of redexes introduced by Sekar and Ramakrishnan. We present a high-level implementation by transforming weakly orthogonal, constructor-based programs into Prolog with the help of parallel deenitional trees. For strategies based on parallel rewriting, this is particularly di...
متن کامل